On generalized communicating P systems with minimal interaction rules
نویسندگان
چکیده
منابع مشابه
Power and Size of Generalized Communicating P Systems with Minimal Interaction Rules
1 Computer and Automation Research Institute Hungarian Academy of Sciences Kende u. 13-17, 1111 Budapest, Hungary, and Eötvös Loránd University, Faculty of Informatics Department of Algorithms and Their Applications Pázmány Péter sétány 1/c, 1117 Budapest, Hungary [email protected] 2 Laboratoire d’Algorithmique, Complexité et Logique Département Informatique, Université Paris Est 61, av. Général...
متن کاملGeneralized communicating P systems
This paper considers a generalization of various communication models based on the P system paradigm where two objects synchronously move across components. More precisely, the model uses blocks of four cells such that pairs of objects from two input cells travel together to target output cells. It is shown that the model introduced, based on interactions between blocks, is complete, being able...
متن کاملOn Generalized Communicating P Systems with One Symbol
Generalized communicating P systems (GCPSs) are purely communicating tissue-like membrane systems with rules for moving pairs of objects. Despite their simplicity, these systems are rather powerful, they are able to generate any recursively enumerable set of numbers even having restricted variants of communication rules. In this paper we show that GCPSs still remain computationally complete if ...
متن کاملOn a workflow model based on generalized communicating P systems
This paper introduces a new formal mathematical model for investigating workflows from dynamical and behavioural point of view. The model is designed on the basis of a special variant of the biology-inspired formal computational model called membrane systems, where the jobs or services are represented by membrane objects whose behaviour is defined by communication and generalization rules. The ...
متن کاملGeneralized Communicating P Systems Working in Fair Sequential Mode
In this article we consider a new derivation mode for generalized communicating P systems (GCPS) corresponding to the functioning of population protocols (PP) and based on the sequential derivation mode and a fairness condition that permits to ensure a particular sequence of configurations. We show that PP can be seen as a particular variant of GCPS. We also consider several stochastic evolutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.020